A Note on Stability of a Linear Functional Equation of Second Order Connected with the Fibonacci Numbers and Lucas Sequences
نویسندگان
چکیده
منابع مشابه
Toeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملA Note on Stability of an Operator Linear Equation of the Second Order
and Applied Analysis 3 If p, 1/q ∈ Z, then solutions f : N0 → Z of the difference equation 1.7 are called the Lucas sequences see, e.g., 24 ; in some special cases they are given specific names; that is, the Fibonacci numbers p −1, q −1, f 0 0, and f 1 1 , the Lucas numbers p −1, q −1, f 0 2, and f 1 1 , the Pell numbers p −2, q −1, f 0 0, and f 1 1 , the Pell-Lucas or companion Lucas numbers p...
متن کاملA Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence
In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore, new sequences have been used in order to introduce a new class of series. All properties of the se...
متن کاملIdentities Involving Lucas or Fibonacci and Lucas Numbers as Binomial Sums
As in [1, 2], for rapid numerical calculations of identities pertaining to Lucas or both Fibonacci and Lucas numbers we present each identity as a binomial sum. 1. Preliminaries The two most well-known linear homogeneous recurrence relations of order two with constant coefficients are those that define Fibonacci and Lucas numbers (or Fibonacci and Lucas sequences). They are defined recursively ...
متن کاملHyers-Ulam stability of K-Fibonacci functional equation
Let denote by Fk,n the nth k-Fibonacci number where Fk,n = kFk,n−1+Fk,n−2 for n 2 with initial conditions Fk,0 = 0, Fk,1 = 1, we may derive a functionalequation f(k, x) = kf(k, x − 1) + f(k, x − 2). In this paper, we solve thisequation and prove its Hyere-Ulam stability in the class of functions f : N×R ! X,where X is a real Banach space.
متن کامل